Prime decomposition theorem for arbitrary semigroups: general holonomy decomposition and synthesis theorem
نویسندگان
چکیده
منابع مشابه
Prime Decomposition Theorem for Arbitrary Semigroups: General Holonomy Decomposition and Synthesis Theorem
Herein we generalize the holonomy theorem for finite semigroups (see [7]) to arbitrary semigroups, S, by embedding s^ into an infinite Zeiger wreath product, which is then expanded to an infinite iterative matrix semigroup. If S is not finite-J-above (where finite-J-above means every element has only a finite number of divisors), then S is replaced by g3, the triple Schtitzenberger product, whi...
متن کاملThe Lebesgue decomposition theorem for arbitrary contents
The decomposition theorem named after Lebesgue asserts that certain set functions have canonical representations as sums of particular set functions called the absolutely continuous and the singular ones with respect to some fixed set function. The traditional versions are for the bounded measures with respect to some fixed measure on a σ algebra, in final form due to Hahn 1921, and for the bou...
متن کاملAlgebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
Introduction. In the following all semigroups are of finite order. One semigroup Si is said to divide another semigroup S2, written Si|S2, if Si is a homomorphic image of a subsemigroup of S2. The semidirect product of S2 by Si, with connecting homomorphism Y, is written S2 Xy Si. See Definition 1.6. A semigroup S is called irreducible if for all finite semigroups S2 and Si and all connecting h...
متن کاملTowards a general Doob-Meyer decomposition theorem
Both the Doob-Meyer and the Graversen-Rao decomposition theorems can be proved following an approach based on predictable compensators of discretizations and weak-L technique, which was developed by K.M. Rao. It is shown that any decomposition obtained by Rao’s method gives predictability of compensators without additional assumptions (like submartingality in the original Doob-Meyer theorem or ...
متن کاملDilworth’s Decomposition Theorem for Posets1
The following theorem is due to Dilworth [12]: Let P be a partially ordered set. If the maximal number of elements in an independent subset (anti-chain) of P is k, then P is the union of k chains (cliques). In this article we formalize an elegant proof of the above theorem for finite posets by Perles [17]. The result is then used in proving the case of infinite posets following the original pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1988
ISSN: 0022-4049
DOI: 10.1016/0022-4049(88)90043-6